Simultaneous Refinements with Complex Compositional Constraints - Example of Singular Value Decomposition to Diagnose Poor Matrix Conditioning

نویسندگان

  • P. S. Whitfield
  • P. W. Stephens
چکیده

A complex refinement of the structure of the battery cathode material, Li1.2Mn0.4Ni0.3Co0.1O2, using neutron and resonant diffraction data is used to demonstrate SVDdiagnostic as a useful tool to diagnose problems in the least squares normal matrix. SVDdiagnostic examines both the unprocessed and pre-conditioned matrices and outputs a 'condition' number as well as combinations of variables causing pseudo-singularity. Shrewd use of this diagnostic tool allowed structural details to be extracted that would otherwise be obliterated by large parameter correlations in such a complex simultaneous refinement. INTRODUCTION One common feature of all Rietveld refinement codes is the inversion of the least-squares normal matrix. This matrix becomes larger and more complex with the number of variables being refined simultaneously. Most Rietveld codes stabilize the least-squares matrix with some kind of preconditioning. This may take the form of an arbitrary diagonal matrix P to derive an alternative matrix B from C using C = P · B · P, where C = A · A is the matrix of normal equations used for solving an over-determined system of weighted observations A · x = b through the equation A ·A · x = A ·b. Solutions are obtained as x = C · A ·b. If the diagonal matrix P is set with element Pii = (Cii), it follows that Pii = (Cii). Accordingly, Bij = Cij(Cii Cjj) while Cij = Bij(Cii Cjj). Inverting B and obtaining C from B is usually more stable than inverting C directly. In the numerical inversion of a matrix, one of the most important values is the ratio of the largest to the smallest singular values in the matrix known as its condition number (CN). Numerical analysts regard log10(CN) to be the minimum number of decimal digits required to avoid catastrophic error propagation. Most Rietveld codes use double-precision, or 14 digits. Consequently a log10(CN) greater than 14 is a serious problem. The matrix that Rietveld codes actually invert is the preconditioned matrix, which usually has a much smaller CN. However, a large CN for the unprocessed matrix can still signal potential problems, even if the CN of the 133 Copyright ©JCPDS-International Centre for Diffraction Data 2007 ISSN 1097-0002

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Large-scale Inversion of Magnetic Data Using Golub-Kahan Bidiagonalization with Truncated Generalized Cross Validation for Regularization Parameter Estimation

In this paper a fast method for large-scale sparse inversion of magnetic data is considered. The L1-norm stabilizer is used to generate models with sharp and distinct interfaces. To deal with the non-linearity introduced by the L1-norm, a model-space iteratively reweighted least squares algorithm is used. The original model matrix is factorized using the Golub-Kahan bidiagonalization that proje...

متن کامل

Graph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members

Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...

متن کامل

Face Recognition Based Rank Reduction SVD Approach

Standard face recognition algorithms that use standard feature extraction techniques always suffer from image performance degradation. Recently, singular value decomposition and low-rank matrix are applied in many applications,including pattern recognition and feature extraction. The main objective of this research is to design an efficient face recognition approach by combining many tech...

متن کامل

Change Point Estimation of the Stationary State in Auto Regressive Moving Average Models, Using Maximum Likelihood Estimation and Singular Value Decomposition-based Filtering

In this paper, for the first time, the subject of change point estimation has been utilized in the stationary state of auto regressive moving average (ARMA) (1, 1). In the monitoring phase, in case the features of the question pursue a time series, i.e., ARMA(1,1), on the basis of the maximum likelihood technique, an approach will be developed for the estimation of the stationary state’s change...

متن کامل

A Dimensionless Parameter Approach based on Singular Value Decomposition and Evolutionary Algorithm for Prediction of Carbamazepine Particles Size

The particle size control of drug is one of the most important factors affecting the efficiency of the nano-drug production in confined liquid impinging jets. In the present research, for this investigation the confined liquid impinging jet was used to produce nanoparticles of Carbamazepine. The effects of several parameters such as concentration, solution and anti-solvent flow rate and solvent...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007